Dual Smoothing and Level Set Techniques for Variational Matrix Decomposition
نویسندگان
چکیده
We focus on the robust principal component analysis (RPCA) problem, and review a range of old and new convex formulations for the problem and its variants. We then review dual smoothing and level set techniques in convex optimization, present several novel theoretical results, and apply the techniques on the RPCA problem. In the final sections, we show a range of numerical experiments for simulated and real-world problems.
منابع مشابه
An Adaptive Variational Model for Image Decomposition
We propose a new model for image decomposition which separates an image into a cartoon, consisting only of geometric objects, and an oscillatory component, consisting of textures and noise. The model is given in a variational formulation with adaptive regularization norms for both the cartoon and texture part. The energy for the cartoon interpolates between total variation regularization and is...
متن کاملFast Variational Bayesian Linear State-Space Model
This paper presents a fast variational Bayesian method for linear state-space models. The standard variational Bayesian expectationmaximization (VB-EM) algorithm is improved by a parameter expansion which optimizes the rotation of the latent space. With this approach, the inference is orders of magnitude faster than the standard method. The speed of the proposed method is demonstrated on an art...
متن کاملSome New Existence, Uniqueness and Convergence Results for Fractional Volterra-Fredholm Integro-Differential Equations
This paper demonstrates a study on some significant latest innovations in the approximated techniques to find the approximate solutions of Caputo fractional Volterra-Fredholm integro-differential equations. To this aim, the study uses the modified Adomian decomposition method (MADM) and the modified variational iteration method (MVIM). A wider applicability of these techniques are based on thei...
متن کاملA Smoothed Dual Approach for Variational Wasserstein Problems
Variational problems that involve Wasserstein distances have been recently proposed to summarize and learn from probability measures. Despite being conceptually simple, such problems are computationally challenging because they involve minimizing over quantities (Wasserstein distances) that are themselves hard to compute. We show that the dual formulation of Wasserstein variational problems int...
متن کاملDouble-Regularization Proximal Methods, with Complementarity Applications
We consider the variational inequality problem formed by a general set-valued maximal monotone operator and a possibly unbounded “box” in Rn , and study its solution by proximal methods whose distance regularizations are coercive over the box. We prove convergence for a class of double regularizations generalizing a previously-proposed class of Auslender et al. Using these results, we derive a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.00284 شماره
صفحات -
تاریخ انتشار 2016